Online Algorithms for Information Aggregation From Distributed and Correlated Sources
نویسندگان
چکیده
منابع مشابه
Distributed Online Aggregation
In many decision making applications, users typically issue aggregate queries. To evaluate these computationally expensive queries, online aggregation has been developed to provide approximate answers (with their respective confidence intervals) quickly, and to continuously refine the answers. In this paper, we extend the online aggregation technique to a distributed context where sites are mai...
متن کاملResearch Report Join Algorithms for Online Aggregation Limited Distribution Notice Join Algorithms for Online Aggregation
This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and speciic requests. After outside...
متن کاملAlgorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources
Development of high throughput data acquisition technologies, together with advances in computing, and communications have resulted in an explosive growth in the number, size, and diversity of potentially useful information sources. This has resulted in unprecedented opportunities in data-driven knowledge acquisition and decisionmaking in a number of emerging increasingly data-rich application ...
متن کاملAdaptive Agents for Information Gathering from Multiple, Distributed Information Sources
The expansion of information available on the Web has been explosive. The initial approach of collecting all Web pages into a single location and indexing them is limited in its ability to deal with this explosion. Different search engines provide access to different collections, requiring users to access multiple information sources to meet their needs. A scalable approach to information gathe...
متن کاملOnline Algorithms for Multi-Level Aggregation
In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edgeweighted tree T , and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2016
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2016.2552083